A fast algorithm for robust constrained clustering
نویسندگان
چکیده
منابع مشابه
A fast algorithm for robust constrained clustering
The application of “concentration” steps is the main principle behind Forgy’s kmeans algorithm and Rousseeuw and van Driessen’s fast-MCD algorithm. Although they share this principle, it is not completely straightforward to combine both algorithms for developing a clustering method which is not affected by a certain proportion of outlying observations and that is able to cope with non spherical...
متن کاملRobust constrained fuzzy clustering
It is well-known that outliers and noisy data can be very harmful when applying clustering methods. Several fuzzy clustering methods which are able to handle the presence of noise have been proposed. In this work, we propose a robust clustering approach called F-TCLUST based on an “impartial” (i.e., self-determined by data) trimming. The proposed approach considers an eigenvalue ratio constrain...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملA Robust Clustering Algorithm for Directional Data
Clustering is a useful tool for the analysis of grouped directional data on the plane. The EM and fuzzy c-directional (FCD) algorithms are two clustering methods for directional data. However, these two algorithms are sensitive to initial values and outliers and also need to give a cluster number a priori. In this paper, we propose a robust clustering algorithm for grouped directional data on t...
متن کاملA Robust Seedless Algorithm for Correlation Clustering
Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlation clustering approaches are sensitive to the initial set of seeds chosen and do not yield the optimal result in the presence of noise. To avoid these problems, we propose RObust SEedless Correlation Clustering (ROSECC) algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Statistics & Data Analysis
سال: 2013
ISSN: 0167-9473
DOI: 10.1016/j.csda.2012.11.018